Approximation by piecewise constants on convex partitions
نویسندگان
چکیده
منابع مشابه
Approximation by piecewise constants on convex partitions
We show that the saturation order of piecewise constant approximation in Lp norm on convex partitions with N cells is N −2/(d+1), where d is the number of variables. This order is achieved for any f ∈ W 2 p (Ω) on a partition obtained by a simple algorithm involving an anisotropic subdivision of a uniform partition. This improves considerably the approximation order N−1/d achievable on isotropi...
متن کاملDiscrete Piecewise Monotonic Approximation by a Strictly Convex Distance Function
Theory and algorithms are presented for the following smoothing problem. We are given n measurements of a real-valued function that have been altered by random errors caused by the deriving process. For a given integer k , some efficient algorithms are developed that approximate the data by minimizing the sum of strictly convex functions of the errors in such a way that the approximated values ...
متن کاملApproximation by Piecewise Exponentials *
A function is called an exponential if it is a linear combination of products of polynomials with pure exponentials. In this paper lower and upper bounds for families of spaces of piecewise exponentials are established. In particular, the exact Lp-approximation order (1 _< p _<) is found for a family {Sh}h>O of function spaces when each Sh is generated by an exponential box spline and its multi...
متن کاملOn 3-monotone approximation by piecewise polynomials
Abstract. We consider 3-monotone approximation by piecewise polynomials with prescribed knots. A general theorem is proved, which reduces the problem of 3-monotone uniform approximation of a 3-monotone function, to convex local L1 approximation of the derivative of the function. As the corollary we obtain Jackson-type estimates on the degree of 3-monotone approximation by piecewise polynomials ...
متن کاملPiecewise Convex-Concave Approximation in the $\ell_{\infty}$ Norm
Suppose that f ∈ IR is a vector of n error-contaminated measurements of n smooth values measured at distinct and strictly ascending abscissae. The following projective technique is proposed for obtaining a vector of smooth approximations to these values. Find y minimizing ‖y− f‖∞ subject to the constraints that the second order consecutive divided differences of the components of y change sign ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 2012
ISSN: 0021-9045
DOI: 10.1016/j.jat.2011.11.001